package merge_sort;

public class quick {
	void Quick_sort (int[] array, int start, int end) {
	     int pivot;
	 
	    if ( start >= end ) {
	        return;
	    }
	    int marker = start;
		 
	       for ( int i = start; i <= end; i++ ) {
	           if ( array[i] <= array[end] ) {
	               int temp = array[marker];
	 
	               array[marker] = array[i];
	               array[i] = temp;
	               marker += 1;
	           }
	       }
	    pivot = marker - 1;
	    Quick_sort (array, start, pivot-1);
	    Quick_sort (array, pivot+1, end);
	}	

}
